Embedding in MDS codes and Latin cubes
نویسندگان
چکیده
An embedding of a code is mapping that preserves distances between codewords. We prove any with distance d $d$ and length n $n$ can be embedded into an maximum separable (MDS) the same but under larger alphabet. As corollary we obtain embeddings systems partial mutually orthogonal Latin cubes -ary quasigroups.
منابع مشابه
On the number of SQSs, latin hypercubes and MDS codes∗
It is established that the logarithm of the number of latin d-cubes of order n is Θ(n ln n) and the logarithm of the number of pairs of orthogonal latin squares of order n is Θ(n ln n). Similar estimations are obtained for systems of mutually strong orthogonal latin d-cubes. As a consequence, it is constructed a set of Steiner quadruple systems of order n such that the logarithm of its cardinal...
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملMaximal Partial Latin Cubes
We prove that each maximal partial Latin cube must have more than 29.289% of its cells filled and show by construction that this is a nearly tight bound. We also prove upper and lower bounds on the number of cells containing a fixed symbol in maximal partial Latin cubes and hypercubes, and we use these bounds to determine for small orders n the numbers k for which there exists a maximal partial...
متن کاملDistance-2 MDS codes and latin colorings in the Doob graphs
The maximum independent sets in the Doob graphs D(m,n) are analogs of the distance-2 MDS codes in Hamming graphs and of the latin hypercubes. We prove the characterization of these sets stating that every such set is semilinear or reducible. As related objects, we study vertex sets with maximum cut (edge boundary) in D(m,n) and prove some facts on their structure. We show that the considered tw...
متن کاملEmbedding finite posets in cubes
ln this paper we defme the n-cube Qn as the poset obtained by t&kmg the Cartesian product sf n chains each zonsjsting of two points. For a finite poset X, we then define dims A as tY;e smallest positive integer n such that X can be embedded as a subpos:: t of QC For any poset X we then have Ilog2 WI 6 dim2 X G IXr. For the distributive Mice f, = z*, dim2 L 5 iXt and for the crown $, dim2(3$) =:...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Designs
سال: 2022
ISSN: ['1520-6610', '1063-8539']
DOI: https://doi.org/10.1002/jcd.21849